TSTP Solution File: AGT028^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : AGT028^2 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 17:57:44 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 46 ( 23 unt; 14 typ; 0 def)
% Number of atoms : 73 ( 16 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 134 ( 24 ~; 14 |; 1 &; 95 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 67 ( 38 ^ 29 !; 0 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_33,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_56,type,
r4: $i > $i > $o ).
thf(decl_58,type,
john: mu ).
thf(decl_62,type,
good_in_maths: mu > $i > $o ).
thf(decl_63,type,
maths_teacher: mu > $i > $o ).
thf(decl_84,type,
esk17_0: $i ).
thf(decl_85,type,
esk18_1: mu > $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mexists_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(axiom_r1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( maths_teacher @ X1 ) @ ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_r1) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(axiom_a6,axiom,
mvalid @ ( maths_teacher @ john ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_a6) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_14,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_17,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_18,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
thf(c_0_19,plain,
! [X23: $i,X22: mu] :
( ~ ( maths_teacher @ X22 @ X23 )
| ! [X21: $i] :
( ~ ( r4 @ X23 @ X21 )
| ( good_in_maths @ X22 @ X21 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_r1]),c_0_15]),c_0_14]),c_0_16]),c_0_17])]) ).
thf(c_0_20,negated_conjecture,
~ ! [X102: $i] :
~ ! [X101: mu] :
~ ! [X100: $i] :
( ~ ( r4 @ X102 @ X100 )
| ( good_in_maths @ X101 @ X100 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_18]),c_0_16]),c_0_17])]) ).
thf(c_0_21,plain,
! [X103: $i,X104: mu,X105: $i] :
( ~ ( maths_teacher @ X104 @ X103 )
| ~ ( r4 @ X103 @ X105 )
| ( good_in_maths @ X104 @ X105 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])])]) ).
thf(c_0_22,negated_conjecture,
! [X183: mu] :
( ( r4 @ esk17_0 @ ( esk18_1 @ X183 ) )
& ~ ( good_in_maths @ X183 @ ( esk18_1 @ X183 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_23,plain,
! [X3: $i,X1: mu,X14: $i] :
( ( good_in_maths @ X1 @ X14 )
| ~ ( maths_teacher @ X1 @ X3 )
| ~ ( r4 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X1: mu] : ( r4 @ esk17_0 @ ( esk18_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,plain,
! [X93: $i] : ( maths_teacher @ john @ X93 ),
inference(apply_def,[status(thm)],[axiom_a6,c_0_17]) ).
thf(c_0_26,negated_conjecture,
! [X1: mu] :
~ ( good_in_maths @ X1 @ ( esk18_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X2: mu,X1: mu] :
( ( good_in_maths @ X1 @ ( esk18_1 @ X2 ) )
| ~ ( maths_teacher @ X1 @ esk17_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_28,plain,
! [X175: $i] : ( maths_teacher @ john @ X175 ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
thf(c_0_29,negated_conjecture,
! [X1: mu] :
~ ( maths_teacher @ X1 @ esk17_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_30,plain,
! [X3: $i] : ( maths_teacher @ john @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : AGT028^2 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.37 % Computer : n027.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sat May 18 18:55:38 EDT 2024
% 0.13/0.37 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_2 with 300s (1) cores
% 0.22/0.51 # post_as_ho3 with pid 24761 completed with status 0
% 0.22/0.51 # Result found by post_as_ho3
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUNS-FFMF32-SHSSMFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # new_ho_10 with pid 24766 completed with status 0
% 0.22/0.51 # Result found by new_ho_10
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUNS-FFMF32-SHSSMFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.002 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 100
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 86
% 0.22/0.51 # Removed in clause preprocessing : 47
% 0.22/0.51 # Initial clauses in saturation : 39
% 0.22/0.51 # Processed clauses : 48
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 48
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 1
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 3
% 0.22/0.51 # ...of the previous two non-redundant : 2
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 3
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 0
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 8
% 0.22/0.51 # Positive orientable unit clauses : 2
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 4
% 0.22/0.51 # Current number of unprocessed clauses: 32
% 0.22/0.51 # ...number of literals in the above : 106
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 40
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 173
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 108
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 1
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 48
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 8850
% 0.22/0.51 # Search garbage collected termcells : 3765
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.011 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.015 s
% 0.22/0.51 # Maximum resident set size: 2532 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.014 s
% 0.22/0.51 # System time : 0.006 s
% 0.22/0.51 # Total time : 0.020 s
% 0.22/0.51 # Maximum resident set size: 1824 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------